array code造句
例句與造句
- An improved error - correcting decoding algorithm for a class of mds array codes
陣列碼的改進糾錯譯碼算法 - This paper researches on the fast algorithm of hamilton array codes for high dimension and big hamming distance and key schedule algorithm based on hamilton array codes
本文主要針對快速高維大碼距hamilton陣列編碼的構(gòu)造算法及其在分組密碼的密鑰編排算法中的應(yīng)用進行了研究。 - Lastly , we design a key schedule algorithm helped by lfsr and hamilton array codes . the innovation of the thesis is given bellow : first : construct and program the fast algorithm of hamilton array codes for high dimension and big hamming distance
本文的創(chuàng)新之處有： 1 、構(gòu)造和實現(xiàn)了快速高維大碼距hamilton的陣列編碼構(gòu)造算法； 2 、提出了一個基于lfsr和hamilton陣列編碼的通用密鑰編排算法。 - The first kind of algorithm is based on s - box controlled by key , the algorithm distinguishes most of other block ciphers , its visible quality is that its s - box is not regular and fixative , but controlled by block cipher ' s key . the second kind of algorithm is based on smn ( d ) array code , it makes full use of the visible quality of smn ( d ) array code possessing big code distance ( d ) . the thesis discusses the two algorithms " reversibility , security and their qualities , the
第一種是基于“ s -盒由密鑰控制”的變結(jié)構(gòu)分組密碼，該算法區(qū)別于其它大部分分組密碼最大的特點是它的s -盒不是固定不變的而是由密鑰控制產(chǎn)生；第二種是基于smn ( d )陣列編碼的變結(jié)構(gòu)分組密碼，該算法充分利用了smn ( d )陣列編碼具有碼距大的特點；文中對這兩個算法的可逆性、安全性及其性能等進行了探討和分析，分析結(jié)果認(rèn)為這兩個變結(jié)構(gòu)算法正確、有效且安全。 - Main contributions of this thesis are as follows : firstly , describe the theory of the hamilton array codes and its general construction . secondly , we construct and program the fast algorithm of hamilton array codes for high dimension and big hamming distance . thirdly , we discussion the design principle of the symmetry ciphers
內(nèi)容包括：首先論述了hamilton陣列編碼的理論和常規(guī)構(gòu)造方法；然后，構(gòu)造和實現(xiàn)了快速高維大碼距hamilton的陣列編碼構(gòu)造算法；接著，探討了對稱密碼（包括分組密碼和序列密碼）的設(shè)計原理，最后，結(jié)合lfsr和hamilton陣列產(chǎn)生通用密鑰編排算法。 - It's difficult to find array code in a sentence. 用array code造句挺難的
- In the paper , we construct the pseudorandom generator based on the hamilton array code and stream cipher after researching the theory of the hamilton array code and the technology of the encrypt . it can improve the ciphers " ability of resisting to many attacks if we use it to replace the key schedule algorithm of the ciphers
本文在研究了hamilton陣列編碼的理論與加密技術(shù)后，構(gòu)造了一個基于hamilton陣列編碼和序列密碼的偽隨機產(chǎn)生器，這個產(chǎn)生器用來替代分組密碼算法的專用密鑰編排算法，可以提高算法的抗攻擊能力，從而實現(xiàn)了對稱密碼兩大領(lǐng)域的結(jié)合。